CMSC 754 Computational Geometry1 David M. Mount Department of Computer Science University of Maryland Spring 2012

Source URL: www.cs.umd.edu

• Computational geometry
• Discrete geometry
• Convex hull
• Delaunay triangulation
• Point location
• Voronoi diagram
• Nearest neighbor search
• Motion planning
• Line
• Proximity problems
• Closest pair of points problem

Lower and Upper Competitive Bounds for Online Directed Graph ExplorationI Klaus-Tycho Foerstera,1,∗, Roger Wattenhofera a ETH Z¨

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Combinatorial optimization
• Edsger W. Dijkstra
• Routing algorithms
• Search algorithms
• NP-complete problems
• Graph traversal
• Shortest path problem
• Matching
• A* search algorithm
• Planar graph

IEEE ROBOTICS AND AUTOMATION LETTERS. PREPRINT VERSION. DECEMBER, Lazy Data Association For Image Sequences Matching Under Substantial Appearance Changes

Source URL: europa2.informatik.uni-freiburg.de

• Mathematics
• Combinatorial optimization
• Graph theory
• Routing algorithms
• Edsger W. Dijkstra
• Search algorithms
• Game artificial intelligence
• A* search algorithm
• Shortest path problem
• Connectivity
• Matching
• Tree

Pooh’s EnclyclopediaRating: fun Think about how search engines work while helping Whinnie the Pooh and his friends solve their problems. Problem:

Source URL: www.nacloweb.org

CS188 Spring 2012 Section 2: A* Search 1 Pancake Heuristics Here, we consider the pancake problem. A server is given a stack of n pancakes. Each pancake is a different

Source URL: inst.eecs.berkeley.edu

1 3D Motion Planning Algorithms for Steerable Needles Using Inverse Kinematics Vincent Duindam1

Source URL: goldberg.berkeley.edu

• Robot kinematics
• Robotics
• Mathematics
• Theoretical computer science
• Search algorithms
• Automated planning and scheduling
• Inverse kinematics
• Motion planning
• Dubins path
• Shortest path problem
• Kinematics
• Algorithm

3D Motion Planning Algorithms for Steerable Needles Using Inverse Kinematics Vincent Duindam1 , Jijie Xu2 , Ron Alterovitz1,3 , Shankar Sastry1 , and Ken Goldberg1,2 1

Source URL: goldberg.berkeley.edu

• Robot kinematics
• Mathematics
• Physics
• Inverse kinematics
• Motion planning
• Dubins path
• A* search algorithm
• Kinematics
• Shortest path problem
• Equation solving

CS 493: Algorithms for Massive Data Sets Feb 21, Local Models, Bloom Filter

Source URL: www.cs.princeton.edu

• Hashing
• Search algorithms
• Statistical theory
• Bloom filter
• Bit array
• Probability distributions
• Hash function
• Entropy
• Golomb coding
• KullbackLeibler divergence
• Birthday problem

greylag: software for tandem mass spectrum peptide identification Greylag is a suite of programs for MS/MS peptide identification by sequence database search. It solves the same basic problem that programs such as SEQUE

Source URL: greylag.org

• Mass spectrometry
• Proteomics
• Bioinformatics
• Tandem mass spectrometry
• Greylag goose
• Mascot
• Monoisotopic mass
• SEQUEST
• Git

CSc 220: Algorithms Homework 5 Solutions Problem 1: We saw in class that given a binary search tree with n elements, we can output the elements in sorted order using a O(n) in-order tree walk. Use this fact and the Ω(n

Source URL: www-cs.ccny.cuny.edu